Autoencoder-Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm

نویسندگان

چکیده

This paper introduces an algorithm for the detection of change-points and identification corresponding subsequences in transient multivariate time-series data (MTSD). The analysis such has become increasingly important due to growing availability many industrial fields. Labeling, sorting or filtering highly measurement training Condition-based Maintenance (CbM) models is cumbersome error-prone. For some applications it can be sufficient filter measurements by simple thresholds finding based on changes mean value variation. But a robust diagnosis component within group example, which complex non-linear correlation between multiple sensor values, approach would not feasible. No meaningful coherent data, could used CbM model, emerge. Therefore, we introduce that uses recurrent neural network (RNN) Autoencoder (AE) iteratively trained incoming data. scoring function reconstruction error latent space information. A model identified subsequence saved recognition repeating as well fast offline clustering. evaluation, propose new similarity measure curvature more intuitive clustering metric. comparison with seven other state-of-the-art algorithms eight datasets shows capability increased performance our cluster MTSD online conjunction mechatronic systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subsequence Time Series Clustering

INTRODUCTION Clustering analysis is a tool used widely in the Data Mining community and beyond (Everitt et al. 2001). In essence, the method allows us to " summarise " the information in a large data set X by creating a very much smaller set C of representative points (called centroids) and a membership map relating each point in X to its representative in C. An obvious but special type of data...

متن کامل

Selective Subsequence Time Series clustering

0950-7051/$ see front matter 2012 Elsevier B.V. A http://dx.doi.org/10.1016/j.knosys.2012.04.022 ⇑ Corresponding author. Tel.: +66 8 9499 9400; fax E-mail addresses: g53srd@cp.eng.chula.ac.th (S. Ro chula.ac.th (V. Niennattrakul), ann@cp.eng.chula.ac.th Subsequence Time Series (STS) Clustering is a time series mining task used to discover clusters of interesting subsequences in time series data...

متن کامل

A Model-Based Multivariate Time Series Clustering Algorithm

Given a set of multivariate time series, the problem of clustering such data is concerned with the discovering of inherent groupings of the data according to how similar or dissimilar the time series are to each other. Existing time series clustering algorithms can divide into three types, raw-based, featurebased and model-based. In this paper, a model-based multivariate time series clustering ...

متن کامل

Translational Symmetry in Subsequence Time-Series Clustering

We treat the problem of subsequence time-series clustering (STSC) from a group-theoretical perspective. First, we show that the sliding window technique introduces a mathematical artifact to the problem, which we call the pseudo-translational symmetry. Second, we show that the resulting cluster centers are necessarily governed by irreducible representations of the translational group. As a resu...

متن کامل

A Review of Subsequence Time Series Clustering

Clustering of subsequence time series remains an open issue in time series clustering. Subsequence time series clustering is used in different fields, such as e-commerce, outlier detection, speech recognition, biological systems, DNA recognition, and text mining. One of the useful fields in the domain of subsequence time series clustering is pattern recognition. To improve this field, a sequenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3247564